Bounded-crossing transducers
نویسندگان
چکیده
منابع مشابه
Crossing Number for Graphs with Bounded~Pathwidth
The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant approximation ratios. Furthermore, up to now, general crossing number computations have never been successfully tackled using bounded width of graph decompositions,...
متن کاملOn the decidability of bounded valuedness of transducers (Preliminary draft)
We give new, conceptually different, and hopefully more easily understandable proofs for two results on transducers: the decidability of k-valuedness (Gurari-Ibarra’s theorem) and the decidability of bounded valuedness (Weber’s theorem). Our constructions yield algorithms that closely depend on the structure of the transducers, and better complexity bounds.
متن کاملOn the Decidability of Bounded Valuedness for Transducers
We give a new and conceptually different proof for the decidability of k-valuedness of transducers (a result due to Gurari and Ibarra), without resorting to any other kind of machines than transducers. In contrast with the previous proof, our algorithm takes into account the structure of the analysed transducers and yields better complexity bounds. With the same techniques, we also present a ne...
متن کاملWord-into-Trees Transducers with Bounded Di erence
Non-deleting Word-into-Trees Transducers with bounded difference are investigated in this paper. Informally, these transducers which produce trees from words have the property that the diierence of height of any couple of trees (the input tree being a word) is bounded. We establish the fact that the tree transformations induced by such transducers have some good closure properties.
متن کاملKemeny Elections with Bounded Single-Peaked or Single-Crossing Width
This paper is devoted to complexity results regarding specific measures of proximity to singlepeakedness and single-crossingness, called “singlepeaked width” [Cornaz et al., 2012] and “singlecrossing width”. Thanks to the use of the PQ-tree data structure [Booth and Lueker, 1976], we show that both problems are polynomial time solvable in the general case (while it was only known for single-pea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1975
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(75)90159-x